"Turán graph" meaning in All languages combined

{
  "etymology_text": "Named after the Hungarian mathematician Pál Turán.",
  "forms": [
    {
      "form": "Turán graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán graph (plural Turán graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets."
      ],
      "hyponyms": [
        {
          "word": "cocktail party graph"
        }
      ],
      "id": "en-Turán_graph-en-noun-yU~ZZQgA",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "multipartite",
          "multipartite"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "set",
          "set"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets."
      ],
      "related": [
        {
          "word": "Turán's theorem"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Pál Turán",
        "Turán graph"
      ]
    }
  ],
  "word": "Turán graph"
}

{
  "etymology_text": "Named after the Hungarian mathematician Pál Turán.",
  "forms": [
    {
      "form": "Turán graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán graph (plural Turán graphs)",
      "name": "en-noun"
    }
  ],
  "hyponyms": [
    {
      "word": "cocktail party graph"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Turán's theorem"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms spelled with Á",
        "English terms spelled with ◌́",
        "English terms with non-redundant non-automated sortkeys",
        "en:Graph theory"
      ],
      "glosses": [
        "A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "multipartite",
          "multipartite"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "set",
          "set"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Pál Turán",
        "Turán graph"
      ]
    }
  ],
  "word": "Turán graph"
}